-
1 unsolvable problems
Общая лексика: неразрешимые проблемы -
2 unsolvable
adjнерозв'язний* * *a -
3 unsolvable
-
4 unsolvable
-
5 unsolvable
a неразрешимыйСинонимический ряд:irresolvable (adj.) fixed; inextricable; insoluble; insolvable; irresoluble; irresolvable; unsoluble -
6 unsolvable
The English-Russian dictionary general scientific > unsolvable
-
7 unsolvable problem
математическая задача, считающаяся неразрешимой, поскольку её решение не удалось найти в течение длительного времени.Student mistook examples of unsolvable math problems for homework and solved them. — Студент по ошибке взял примеры неразрешимых математических задач в качестве домашнего задания и решил их! см. тж. problem
Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > unsolvable problem
-
8 unsolvable
неразрешимый неразрешимый - * problems неразрешимые проблемыБольшой англо-русский и русско-английский словарь > unsolvable
-
9 computing problems
-
10 dispose of some problems
-
11 sort out its problems
-
12 sleeping problems
См. также в других словарях:
unsolvable — insoluble, unsolvable Insoluble relates to the meanings of dissolve as well as solve, and therefore refers to difficulties, questions, and problems that cannot be answered as well as to substances that cannot be absorbed in liquid. Unsolvable is… … Modern English usage
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
Proof of impossibility — A proof of impossibility, sometimes called a negative proof or negative result , is a proof demonstrating that a particular problem cannot be solved, or cannot be solved in general. Often proofs of impossibility have put to rest decades or… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia